Diagonal Tuple Space Search in Two Dimensions

Due to the evolution of the Internet and its services, the process of forwarding packets in routers is becoming more complex. In order to execute the sophisticated routing logic of modern firewalls, multidimensional packet classification is required. Unfortunately, the multidimensional packet classification algorithms are known to be either time or storage hungry in the general case. It has been anticipated that more feasible algorithms could be obtained for conflict-free classifiers. This paper proposes a novel two-dimensional packet classification algorithm applicable to the conflict-free classifiers. It derives from the well-known tuple space paradigm and it has the search cost of Ο(log w) and storage complexity of Ο(n2 log w), where w is the width of the protocol fields given in bits and n is the number of rules in the classifier. This is remarkable because without the conflict-free constraint the search cost in the twodimensional tuple space is Θ(w).